A Thread Algebra with Multi-Level Strategic Interleaving

Process algebra with strategic interleaving

In process algebras such as ACP, parallel processes are considered to be interleaved in an arbitrary way. In the case of multi-threading as found in contemporary programming languages, parallel processes are actually interleaved according to some interleaving strategy. Interleaving strategies are also known as process-scheduling policies. In many systems, for instance hardware/software systems,...

Thread Algebra with Multi-Level Strategies

In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on thread vectors. The strategic interleaving of a thread vector constitutes a multi-thread. Several multi-threads may exist concurrently on a single host in a network, several host behaviors may exist concurrently...

Non Interleaving Process Algebra

Reduction and Topology, p. 28.

Program Algebra and Thread Algebra

Process algebra with interleaving probabilistic parallel composition

In this paper we present a probabilistic version of the axiom system A CP appropriate for the (algebraic) formal description of pIobabilisti.c processes. The proposed formalism is built in a modular way, first Basic Process Algebra (prBPA) is constructed which afterwards is extended by parallel composition (prACP). Probabilities are introduced by an operator for internal probabilistic choice. I...